Strassen's Algorithm Made (Somewhat) More Natural: A Pedagogical Remark
نویسندگان
چکیده
Strassen's 1969 algorithm for fast matrix multiplication 2] is based on the possibility to multiply two 2 2 matrices A and B by using 7 multiplications instead of the usual 8. The corresponding formulas are an important part of any algorithms course, but, unfortunately, even in the best textbook expositions (see, e.g., 1]), they look very ad hoc. In this paper, we show that the use of natural symmetries can make these formulas more natural. Outline. The goal of this paper is to show that the use of symmetries can make Strassen's formulas for multiplying two 2 2 matrices A and B in 7 multiplications more natural. To achieve this goal, we will rst describe two relevant symmetries: the rst one is more straightforward, the second one is slightly more implicit. Then, we use these symmetries to select 7 combinations of matrix elements. Finally, we use the same symmetries to pair the combinations corresponding to A and B with each other and thus, to come up with Strassen's formulas. A = a 11 a 12 a 21 a 22 describes a linear transformation of a 2-dimensional space into itself; the product of two matrices corresponds to the composition of two linear transformations. In this interpretation, the elements of the matrix describe the coordinates of the results Ae 1 and Ae 2 of applying this transformation to the unit vectors e 1 = (1; 0) and e 2 = (0; 1) corresponding to the natural axes: Ae 1 = a 11 e 1 +a 21 e 2 , and Ae 2 = a 12 e 1 + a 22 e 2. From this geometric viewpoint what matters is the transformation itself, while the order in which we describe the axes is irrelevant. If we change this order, we get new unit vectors e 0 i = e (i) ; where (1) = 2 and (2) = 1. In the new axes, the same transformation is represented by a new matrix A 0 = (A) with a 0 ij = a (i)(j) : Similarly, the transformation corresponding to the matrix B is represented, in the new axes, by the similarly permuted matrix B 0 = (B) with b 0 ij = b (i)(j) , and the product matrix C = AB (corresponding to the composition of the two transformations) takes the form C 0 = (C) with c 0 ij = c …
منابع مشابه
What Is a Gaussian State?
Stimulated by a remark of J. L. Doob at the beginning of Appendix I to Kai Lai Chung’s English translation “Limit Distributions for Sums of Independent Variables” of the Russian classic by B. V. Gnedenko and A. N. Kolmogorov [5] we highlight the somewhat nonprobabilistic importance of characteristic functions and their positive definiteness property in a pedagogical attempt to introduce the not...
متن کاملArchitecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...
متن کاملStrassen's 2x2 matrix multiplication algorithm: A conceptual perspective
Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multiply two 2x2 matrices with only seven multiplications involve some more or less tedious calculations such as explicitly multiplying specific 2x2 matrices, expanding expressions to cancel terms with opposing signs, or expanding tensors over the standard basis. This is why the proof is nontrivial to m...
متن کاملNaïve Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment
Naivno množenje matrica In the first section, we will give mathematical reasoning of Strassen's alghoritm for matrix multiplication. First a naïve method for matrix multiplication is explained, and then it is extended to more advanced Strassen's method. In the following section a description of programming language and framework is given, with explanation of the algorithm's implementation. Last...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of the EATCS
دوره 73 شماره
صفحات -
تاریخ انتشار 2001